A Composite Metric Routing Approach for Energy-Efficient Shortest Path Planning on Natural Terrains
نویسندگان
چکیده
This paper explores the problem of energy-efficient shortest path planning on off-road, natural, real-life terrain for unmanned ground vehicles (UGVs). We present a greedy algorithm based composite metric routing approach that combines energy consumption and distance path. In our work, we consider Terramechanics between UGV soil to account wheel sinkage effect, in addition slope deformation limitations development algorithm. As benchmarks comparison, use recent energy-cost minimization approach, an ant colony optimization (ACO) implementation. Our results indicate proposed outperforms state-of-the-art method terms resulting distance, with negligible increase consumption. Moreover, also strongly ACO implementation quality paths obtained running time. fact, time indicates its suitability large natural graphs thousands nodes tens links.
منابع مشابه
Energy Efficient Multi Path Routing Protocol in Internet of Things
Internet of things (IoT) is a network with a wide range of smart and physical objects and gadgets that can exchange information with each other. IOT introduces a variety of services that human life is dependent on its secure and accessible activities. These networks face numerous problems in terms of energy consumption and reliable communication to send the correct data. Moreover, the character...
متن کاملRethinking Shortest Path: An Energy Expenditure Approach
Considering that humans acting in constrained environments do not always plan according to shortest path criteria; rather, they conceptually measure the path which minimises the amount of expended energy. Hence, virtual characters should be able to execute their paths according to planning methods based not on path length but on the minimisation of actual expended energy. Thus, in this paper, w...
متن کاملEnergy-Efficient Shortest Path Algorithms for Convergecast in Sensor Networks
We introduce a variant of the capacitated vehicle routing problem that is encountered in sensor networks for scientific data collection. Consider an undirected graph G = (V ∪ {sink}, E). Each vertex v ∈ V holds a constantsized reading normalized to 1 byte that needs to be communicated to the sink. The communication protocol is defined such that readings travel in packets. The packets have a cap...
متن کاملA Hybrid Routing Algorithm for an Efficient Shortest Path Decision in Network Routing
Recently, shortest path tree construction is essential in network routing. Dijkstra algorithm, one of the static routing algorithms, is widely used. When some links develop new weights, dynamic routing algorithms become more efficient than static routing algorithms. This is because dynamic routing algorithms reduce the redundancy caused by re-computing the affected part of the network in regard...
متن کاملShortest-path metric approximation for random subgraphs
We consider graph optimization problems where the cost of a solution depends only on the shortest-path metric in the graph, such as Steiner Tree or Traveling Salesman. We study a scenario where such a problem needs to be solved repeatedly on random subgraphs of a given graph G. With the goal of speeding up the repeated queries and saving space, we describe the construction of a sparse subgraph ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2021
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app11156939